Online Train Disposition: To Wait or Not to Wait?
نویسندگان
چکیده
We deal with an online problem arising from bus/tram/train disposition problems. In particular, we look at the case in which the delay is unknown and the vehicle can only wait in a station so as to minimize the passengers’ waiting time. We present deterministic polynomial-time optimal algorithms and matching lower bounds for several problem versions. In addition, all lower bounds also apply to randomized algorithms, thus implying that using randomization does not help.
منابع مشابه
Improving Wait Times to Care for Individuals with Multimorbidities and Complex Conditions Using Value Stream Mapping
Background Recognizing the significant impact of wait times for care for individuals with complex chronic conditions, we applied a LEAN methodology, namely – an adaptation of Value Stream Mapping (VSM) to meet the needs of people with multiple chronic conditions and to improve wait times without additional resources or funding. Methods Over an 18-month time period, staff applied a patient-cen...
متن کاملIncreasing Operating Room Profits and Decreasing Wait Lists by Use of a Data-Driven Overbooking Model
Background and Objectives: Operating rooms (ORs) are precious resources in hospitals, as they constitute more than 40% of the hospital revenues.As such, surgical cancellations are very costly to hospitals. Same-day surgery cancellations or no-shows were found to be the main contributing factor to underutilization of operating rooms (ORs) in a public-sector hospital despite the ...
متن کاملAn Assessment of Online Reviews of Hand Surgeons
Background: The purpose of this study is to evaluate the number of reviews and scores for active members of the American Society for Surgery of the Hand (ASSH) in popular physician rating websites (Healthgrades.com and Vitals.com). Methods: A total of 433 ASSH active members were searched in two popular rating websites for a total of 866 web searches. Demographic data, overall and subcategory ...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملCan a Healthcare “Lean Sweep” Deliver on What Matters to Patients?; Comment on “Improving Wait Times to Care for Individuals with Multimorbidities and Complex Conditions Using Value Stream Mapping”
Disconnects and defects in care – such as duplication, poor integration between services or avoidable adverse events – are costly to the health system and potentially harmful to patients and families. For patients living with multiple chronic conditions, such disconnects can be particularly detrimental. Lean is an approach to optimizing value by reducing waste (eg, duplication and defects) and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 66 شماره
صفحات -
تاریخ انتشار 2002